D2Pt: Privacy-Aware Multiparty Data Publication
نویسندگان
چکیده
Today, publication of medical data faces high legal barriers. On the one hand, publishing medical data is important for medical research. On the other hand, it is neccessary to protect peoples’ privacy by ensuring that the relationship between individuals and their related medical data remains unknown to third parties. Various data anonymization techniques remove as little identifying information as possible to maintain a high data utility while satisfying the strict demands of privacy laws. Current research in this area proposes a multitude of concepts for data anonymization. The concept of k-anonymity allows data publication by hiding identifying information without losing its semantics. Based on k-anonymity, the concept of t-closeness incorporates semantic relationships between personal data values, therefore increasing the strength of the anonymization. However, these concepts are restricted to a centralized data source. In this paper, we extend existing data privacy mechanisms to enable joint data publication among multiple participating institutions. In particular, we adapt the concept of t-closeness for distributed data anonymization. We introduce Distributed two-Party t-closeness (D2Pt), a protocol that utilizes cryptographic algorithms to avoid a central component when anonymizing data adhering the t-closeness property. That is, without a trusted third party, we achieve a data privacy based on the notion of t-closeness.
منابع مشابه
Preserved Collaborative Secure Multiparty Data Mining
Problem statement: In the current modern business environment, its success is defined by collaboration, team efforts and partnership, rather than lonely spectacular individual efforts in isolation. So the collaboration becomes especially important because of the mutual benefit it brings. Sometimes, such collaboration even occurs among competitors, or among companies that have conflict of intere...
متن کاملA Method for Privacy Preserving Data Mining in Secure Multiparty Computation using Hadamard Matrix
Secure multiparty computation allows multiple parties to participate in a computation. SMC (secure multiparty computation) assumes n parties where n>1. All the parties jointly compute a function. Privacy preserving data mining has become an emerging field in the secure multiparty computation. Privacy preserving data mining preserves the privacy of individual's data. Privacy preserving data mini...
متن کاملSecured disclosure of data in multiparty clustering
Data mining can extract important knowledge from large data collections sometimes these collections are distributed among multiple parties. Privacy concerns may prevent the parties from directly sharing the data and some type of information about data. This work presents a distributed privacy-preserving k-clustering. K-means were used for clustering and that will be applied to the data bases th...
متن کاملSecure Multiparty Computation for Privacy-Preserving Data Mining
In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demonstrate the difficulties involved in constructing highly efficient protocols. We also present comm...
متن کاملPrivacy-preserving Collaborative Filtering based on Randomized Perturbation Techniques and Secure Multiparty Computation
With the evolution of the Internet, collaborative filtering techniques are becoming increasingly popular in E-commerce recommender systems. Such techniques recommend items to users employing similar users' preference data. People use recommender systems to cope with information overload. Although collaborative filtering systems are widely used by E-commerce sites, they fail to protect users' pr...
متن کامل